Sturmian words, β-shifts, and transcendence
نویسندگان
چکیده
Consider the minimal β-shift containing the shift space generated by a given Sturmian word. In this paper we characterize such β and investigate their combinatorial, dynamical and measure-theoretical properties and prove that such β are transcendental numbers.
منابع مشابه
Occurrence and Lexicographic Properties of Standard Sturmian Words
Standard Sturmian words form an interesting class of structurally highly compressible strings. represented by simple recurrences. We show that simplicity of representation implies new algorithmic results: the compressed string matching for such words can be solved by very special algorithms and the output is simply characterized. Each standard Sturmian word w has Occurrence Shift Property: the ...
متن کاملOn powers of words occurring in binary codings of rotations
We discuss combinatorial properties of a class of binary sequences generalizing Sturmian sequences and obtained as a coding of an irrational rotation on the circle with respect to a partition in two intervals. We give a characterization of those having a finite index in terms of a two-dimensional continued fraction like algorithm, the so-called D-expansion. Then, we discuss powers occurring at ...
متن کاملTranscendence of Sturmian or Morphic Continued Fractions
We prove, using a theorem of W. Schmidt, that if the sequence of partial quotients of the continued fraction expansion of a positive irrational real number takes only two values, and begins with arbitrary long blocks which are ''almost squares,'' then this number is either quadratic or transcendental. This result applies in particular to real numbers whose partial quotients form a Sturmian (or ...
متن کاملA Generalization of Sturmian Sequences; Combinatorial Structure and Transcendence∗
In this paper we study dynamical properties of a class of uniformly recurrent sequences on a k-letter alphabet with complexity p(n) = (k − 1)n + 1. These sequences, originally defined by P. Arnoux and G. Rauzy, are a natural generalization of the (binary) Sturmian sequences of Morse and Hedlund. We give two combinatorial algorithms for constructing characteristic Arnoux-Rauzy sequences. The fir...
متن کاملA Characterization of Bispecial Sturmian Words
A finite Sturmian word w over the alphabet {a, b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that bispecial Sturmian words are exactly the maximal internal factors of Christoffel words, that are words coding the digital approximations of s...
متن کامل